A generalised isodiametric problem

نویسنده

  • Christos Pelekis
چکیده

Fix positive integers a and b such that a > b ≥ 2 and a positive real δ > 0. Let S be a planar set of diameter δ having the following property: for every a points in S, at least b of them have pairwise distances that are all less than or equal to 2. What is the maximum Lebesgue measure of S? In this paper we investigate this problem. We discuss the, devious, motivation that leads to its formulation and provide upper bounds on the Lebesgue measure of S. Our main result is based on a generalisation of a theorem that is due to Heinrich Jung. In certain instances we are able to find the extremal set but the general case seems elusive.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantitative Stability in the Isodiametric Inequality via the Isoperimetric Inequality

The isodiametric inequality is derived from the isoperimetric inequality trough a variational principle, establishing that balls maximize the perimeter among convex sets with fixed diameter. This principle brings also quantitative improvements to the isodiametric inequality, shown to be sharp by explicit nearly optimal sets.

متن کامل

Isoperimetric and Isodiametric Functions of Finite Presentations

We survey current work relating to isoperimetric functions and isodiametric functions of finite presentations. §

متن کامل

Isodiametric and Isoperimetric Inequalities for Complexes and Groups

It is shown that D. Cohen’s inequality bounding the isoperimetric function of a group by the double exponential of its isodiametric function is valid in the more general context of locally finite simply connected complexes. It is shown that in this context this bound is ‘best possible ’. Also studied are seconddimensional isoperimetric functions for groups and complexes. It is shown that the se...

متن کامل

An Isodiametric Problem for Equilateral Polygons

The maximal perimeter of an equilateral convex polygon with unit diameter and n = 2m edges is not known when m ≥ 4. Using experimental methods, we construct improved polygons for m ≥ 4, and prove that the perimeters we obtain cannot be improved for large n by more than c/n4, for a particular constant c.

متن کامل

Isodiametric Problems for Polygons

The maximal area of a polygon with n = 2m edges and unit diameter is not known when m ≥ 5, nor is the maximal perimeter of a convex polygon with n = 2m edges and unit diameter known when m ≥ 4. We construct improved polygons in both problems, and show that the values we obtain cannot be improved for large n by more than c1/n in the area problem and c2/n in the perimeter problem, for certain con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1507.01631  شماره 

صفحات  -

تاریخ انتشار 2015